Discovering Invariants in the Analysis and Verification of Finite State Transition Systems by Jie-Hong
نویسندگان
چکیده
Discovering Invariants in the Analysis and Verification of Finite State Transition Systems
منابع مشابه
Statechart Verification with iState
The statechart formalism, proposed by Harel [6] as an extension of conventional finite state machines, is a visual language for specifying reactive systems. It addresses the state explosion problem of state transition diagrams when modeling systems with parallel threads of control by introducing the concepts of hierarchy, concurrency, and communication. The iState tool translates statecharts in...
متن کاملFunctional Dependency for Verification Reduction
The existence of functional dependency among the state variables of a state transition system was identified as a common cause of inefficient BDD representation in formal verification. Eliminating such dependency from the system compacts the state space and may significantly reduce the verification cost. Despite the importance, how to detect functional dependency without or before knowing the r...
متن کاملAutomatic Generation of Invariants in Processor Verification
A central task in formal verification is the definition of invariants, which characterize the reachable states of the system. When a system is finitestate, invariants can be discovered automatically. Our experience in verifying microprocessors using symbolic logic is that finding adequate invariants is extremely time-consuming. We present three techniques for automating the discovery of some of...
متن کاملTimeout and Calendar Based Finite State Modeling and Verification of Real-Time Systems
We revisit the problem of real-time verification with dense time dynamics using timeout and calendar based models, originally proposed by Dutertre and Sorea, and simplify this to a finite state verification problem. To overcome the complexity of verification of real-time systems with dense time dynamics, Dutertre and Sorea, proposed timeout and calender based transition systems to model the beh...
متن کاملOn Some Transformation Invariants Under Retiming and Resynthesis
Transformations using retiming and resynthesis operations are the most important and practical (if not the only) techniques used in optimizing synchronous hardware systems. Although these transformations have been studied extensively for over a decade, questions about their optimization capability and verification complexity are not answered fully. Resolving these questions may be crucial in de...
متن کامل